A Schur Logarithmic Algorithm for Fractional Powers of Matrices
نویسندگان
چکیده
We describe a recurrence method for computing primary pth roots of a matrix A with a cost, in terms of elementary arithmetic operations and memory, which is logarithmic with respect to p. When A is real and the primary root is real as well, the algorithm is based on the real Schur form of A and uses real arithmetic. The numerical experiments confirm the good behavior of the new algorithm in finite arithmetic. The case of arbitrary fractional powers of A is also considered.
منابع مشابه
An Improved Schur-Padé Algorithm for Fractional Powers of a Matrix and Their Fréchet Derivatives
The Schur–Padé algorithm [N. J. Higham and L. Lin, SIAM J. Matrix Anal. Appl., 32 (2011), pp. 1056–1078] computes arbitrary real powers At of a matrix A ∈ Cn×n using the building blocks of Schur decomposition, matrix square roots, and Padé approximants. We improve the algorithm by basing the underlying error analysis on the quantities ‖(I − A)k‖1/k , for several small k, instead of ‖I−A‖. We ex...
متن کاملProperties of matrices with numerical ranges in a sector
Let $(A)$ be a complex $(ntimes n)$ matrix and assume that the numerical range of $(A)$ lies in the set of a sector of half angle $(alpha)$ denoted by $(S_{alpha})$. We prove the numerical ranges of the conjugate, inverse and Schur complement of any order of $(A)$ are in the same $(S_{alpha})$.The eigenvalues of some kinds of matrix product and numerical ranges of hadmard product, star-congruen...
متن کاملDomination number of graph fractional powers
For any $k in mathbb{N}$, the $k$-subdivision of graph $G$ is a simple graph $G^{frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$. In [Moharram N. Iradmusa, On colorings of graph fractional powers, Discrete Math., (310) 2010, No. 10-11, 1551-1556] the $m$th power of the $n$-subdivision of $G$ has been introduced as a fractional power of $G$, denoted by ...
متن کاملOn the powers of fuzzy neutrosophic soft matrices
In this paper, The powers of fuzzy neutrosophic soft square matrices (FNSSMs) under the operations $oplus(=max)$ and $otimes(=min)$ are studied. We show that the powers of a given FNSM stabilize if and only if its orbits stabilize for each starting fuzzy neutrosophic soft vector (FNSV) and prove a necessary and sufficient condition for this property using the associated graphs of the FNSM. ...
متن کاملLinear Fractional Transformations and Balanced Realization of Discrete-Time Stable All-Pass Systems
The tangential Schur algorithm provides a means of constructing the class of p×p discretetime stable all-pass transfer functions of a prescribed McMillan degree n. In each of its n iteration steps a linear fractional transformation is employed which is associated with a Jinner rational matrix of McMillan degree 1 involving certain parameters. In this set-up, the issue of generating correspondin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 34 شماره
صفحات -
تاریخ انتشار 2013